A Variant of the F4 Algorithm
نویسندگان
چکیده
Algebraic cryptanalysis usually requires to find solutions of several similar polynomial systems. A standard tool to solve this problem consists of computing the Gröbner bases of the corresponding ideals, and Faugère’s F4 and F5 are two well-known algorithms for this task. In this paper, we present a new variant of the F4 algorithm which is well suited to algebraic attacks of cryptosystems since it is designed to compute Gröbner bases of a set of polynomial systems having the same shape. It is faster than F4 as it avoids all reductions to zero, but preserves its simplicity and its computation efficiency, thus competing with F5.
منابع مشابه
PreRkTAG: Prediction of RNA Knotted Structures Using Tree Adjoining Grammars
Background: RNA molecules play many important regulatory, catalytic and structural <span style="font-variant: normal; font-style: norma...
متن کاملAn Efficient Coupled Genetic Algorithm-NLP Method for Heat Exchanger Network Synthesis
Synthesis of heat exchanger networks (HENs) is inherently a mixed integer and nonlinear programming (MINLP) problem. Solving such problems leads to difficulties <span style="font-size: 10pt; color: #00...
متن کاملTime Variant Fuzzy Time Series Approach for Forecasting Using Particle Swarm Optimization
Fuzzy time series have been developed during the last decade to improve the forecast accuracy. Many algorithms have been applied in this approach of forecasting such as high order time invariant fuzzy time series. In this paper, we present a hybrid algorithm to deal with the forecasting problem based on time variant fuzzy time series and particle swarm optimization algorithm, as a highly effi...
متن کاملEnhanced ACS algorithms for plastic analysis of planar frames
In recent years, the trend in solving optimization problems has been directed toward using heuristic algorithms such as neural networks, genetic and ant colony algorithms. The main reason for this trend can be attributed to the fact that these algorithms can be efficiently adjusted to the specific search space to which they are applied and consequently they can be used for many optimization pro...
متن کاملA hybrid neural–genetic algorithm for predicting pure and impure CO2 minimum miscibility pressure
"> Accurate prediction of the minimum miscibility pressure (MMP) in a gas injection process is crucial to optimizing the management of gas injection projects. Because the <span style="font-size: 10pt; ...
متن کامل